A basis theorem for a class of max-plus eigenproblems
نویسندگان
چکیده
We study the max-plus equation P þ cðxÞ 1⁄4 max xpspM ðHðsÞ þ cðgðsÞÞÞ; xA1⁄20;M ; ð*Þ where H : 1⁄20;M -ð N;NÞ and g : 1⁄20;M -1⁄20;M are given functions. The function c : 1⁄20;M -1⁄2 N;NÞ and the quantity P are unknown, and are, respectively, an eigenfunction and additive eigenvalue. Eigensolutions c are known to describe the asymptotics of certain solutions of singularly perturbed differential equations with state dependent time lags. Under general conditions we prove the existence of a finite set (a basis) of eigensolutions j; for 1pipq; with the same eigenvalue P; such that the general solution c to ð*Þ is given by cðxÞ 1⁄4 ðc þ jðxÞÞ3ðc þ jðxÞÞ3?3ðc þ jðxÞÞ: Here cA1⁄2 N;NÞ are arbitrary quantities and 3 denotes the maximum operator. In many cases q 1⁄4 1 so the solution c is unique up to an additive constant. r 2002 Elsevier Science (USA). All rights reserved.
منابع مشابه
Max-Plus algebra on tensors and its properties
In this paper we generalize the max plus algebra system of real matrices to the class of real tensors and derive its fundamental properties. Also we give some basic properties for the left (right) inverse, under the new system. The existence of order 2 left (right) inverses of tensors is characterized.
متن کاملMyhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.
In series-parallel SPN, the completion time distribution...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...
متن کاملThe Minkowski Theorem for Max-plus Convex Sets
We establish the following max-plus analogue of Minkowski’s theorem. Any point of a compact max-plus convex subset of (R∪{−∞})n can be written as the max-plus convex combination of at most n + 1 of the extreme points of this subset. We establish related results for closed max-plus convex cones and closed unbounded max-plus convex sets. In particular, we show that a closed max-plus convex set ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003